Proving the Completeness Theorem within Isabelle/HOL
نویسنده
چکیده
This is a report about formalising a maths proof with the theorem prover Isabelle/HOL. The proof was for the completeness theorem of first order logic. The informal proof used symmetry arguments (duality) and also gave the cut elimination theorem as a corollary. Both these aspects were preserved formally. The paper outlines this formalisation. It notes that parts of the proof can be viewed as a correctness proof for a naive proof procedure. Some speculative comments about the possibility of a proven reflection principle are made in the conclusions.
منابع مشابه
Using Yices as an automated solver in Isabelle/HOL
We describe our integration of the Yices SMT solver into the Isabelle theorem prover. This integration allows users to take advantage of the powerful SMT solving techniques within the interactive theorem proving environment of Isabelle, considerably increasing the automation level for a significant subset of Isabelle/HOL.
متن کاملFormalization of Bachmair and Ganzinger's Ordered Resolution Prover
This Isabelle/HOL formalization covers Sections 2 to 4 of Bachmair and Ganzinger’s “Resolution Theorem Proving” chapter in the Handbook of Automated Reasoning. This includes soundness and completeness of unordered and ordered variants of ground resolution with and without literal selection, the standard redundancy criterion, a general framework for refutational theorem proving, and soundness an...
متن کاملFormal Verification of Algorithm W: The Monomorphic Case
A formal veri cation of the soundness and completeness of Milner s type inference algorithm W for simply typed lambda terms is presented Particular attention is paid to the notorious issue of new variables The proofs are carried out in Isabelle HOL the HOL instan tiation of the generic theorem prover Isabelle
متن کاملA Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic
We present a system of first order logic, together with soundness and completeness proofs wrt. standard first order semantics. Proofs are mechanised in Isabelle/HOL. Our definitions are computable, allowing us to derive an algorithm to test for first order validity. This algorithm may be executed in Isabelle/HOL using the rewrite engine. Alternatively the algorithm has been ported to OCaML.
متن کاملAutomating Algebraic Methods in Isabelle
We implement a large Isabelle/HOL repository of algebras for application in modelling computing systems. They subsume computational logics such as dynamic and Hoare logics and form a basis for various software development methods. Isabelle has recently been extended by automated theorem provers and SMT solvers. We use these integrated tools for automatically proving several rather intricate ref...
متن کامل